Scheduling Imprecise Computation Tasks with Intra-task / Inter-task Dependence
نویسنده
چکیده
This work presents two heuristics to be used as admission policy in imprecise task systems. It is assumed that imprecise tasks have intra-task and inter-task dependence and a 0/1 constraint. These heuristics are supposed to be used combined with off-line schedulability tests and on-line acceptance tests already described in the literature. The objective of the admission policy is to maximize system utility through the selection of optional parts for execution. Simulation is used to analyze the proposed heuristics.
منابع مشابه
An Optimal Task Scheduling Algorithm in Wireless Sensor Networks
Abstract: Sensing tasks should be allocated and processed among sensor nodes in minimum times so that users can draw useful conclusions through analyzing sensed data. Furthermore, finishing sensing task faster will benefit energy saving, which is critical in system design of wireless sensor networks. To minimize the execution time (makespan) of a given task, an optimal task scheduling algorithm...
متن کاملA Fast Algorithm for Scheduling Imprecise Computations with Timing Constraints to Minimize Weighted Error
Scheduling tasks with dflerent weights in the imprecise computation model is rather dflcult. Each task in the imprecise computation model is logically decomposed into a mandatory subtask and an optional subtask. The mandatory subtask must be completely executed before the deadline to produce acceptable result; the optional subtask begins after the mandatory subtask to refine the result. The err...
متن کاملAlgorithms for Scheduling Imprecise Computations with Timing Constraints
We consider here the problem of scheduling tasks in the imprecise computation model to minimize the maximum error. Given a task system and a schedule of it, the maximum error of the task system is equal to the error of the task that has the largest error when the task system is executed according to the schedule. We describe two preemptive algorithms for scheduling on a processor n dependent ta...
متن کاملApplying Extended Imprecise Computation to QoS Management in Industrial Applications
The imprecise computation technique [7] enhances the responsiveness and graceful degradation of realtime systems by allowing greater scheduling flexibility. It is applicable whenever a task can produce a poorer-quality imprecise result in less execution time than it would take to produce a high-quality exact one in order to conserve resources. The imprecise real-time task model [5] is an extens...
متن کاملImprecise Task Schedule Optimization
Considerable research has been done in order to schedule tasks to a multiple processing systems. Some of the computation time of these tasks may, however, be imprecise due to the nature of the problem. In this paper, an imprecise task graph is used to model the problem where each node represents a task associated with its computation time. An algorithm, called rotation scheduling, is extended t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006